New Good Quasi-cyclic Codes over Gf(3)
نویسندگان
چکیده
Abstract In this paper some good quasi-cyclic codes over GF(3) are presented. These quasi-cyclic codes improve the already known lower bounds on the minimum distance of the previously known quasi-cyclic codes. Even though these codes do not improve the minimum distance of the best unstructured code known, their beautiful structure and simplicity provide several advantages in comparison to other random codes. Also, three of the ternary quasi-cyclic codes presented have parameters [66,11, 33; 3], [65,13, 30; 3], [56,14, 24; 3] and so their minimum distances beat the minimum distances of the previously known quasi-cyclic codes and meet the minimum distances of the best unstructured linear codes with these parameters.
منابع مشابه
Some New Ternary Linear Codes
Abstract: Let q d k n , , code be a linear code of length n, dimension k and minimum Hamming distance d over GF (q). One of the most important problems in coding theory is to construct codes with best possible minimum distances. In this paper new one-generator quasi-cyclic (QC) codes over GF (3) are presented. Some of the results are received by construction X.
متن کاملNew linear codes over GF(8)1
Let [n, k, d]q-code be a linear code of length n, dimension k and minimum Hamming distance d over GF (q). One of the most important problems in coding theory is to construct codes with best possible minimum distances. Recently, the class of quasi-cyclic (QC) codes has been proven to contain many such codes. In this paper, thirty two codes over GF (8) are constructed (among them one optimal code...
متن کاملSkew Generalized Quasi-cyclic Codes
This article discusses skew generalized quasi-cyclic codes over any finite field F with Galois automorphism θ. This is a generalization of quasi-cyclic codes and skew polynomial codes. These codes have an added advantage over quasi-cyclic codes since their lengths do not have to be multiples of the index. After a brief description of the skew polynomial ring F[x; θ], we show that a skew general...
متن کاملOptimal Linear Codes Over GF(7) and GF(11) with Dimension 3
Let $n_q(k,d)$ denote the smallest value of $n$ for which there exists a linear $[n,k,d]$-code over the Galois field $GF(q)$. An $[n,k,d]$-code whose length is equal to $n_q(k,d)$ is called {em optimal}. In this paper we present some matrix generators for the family of optimal $[n,3,d]$ codes over $GF(7)$ and $GF(11)$. Most of our given codes in $GF(7)$ are non-isomorphic with the codes pre...
متن کاملGood Quasi-Cyclic Codes Derived From Irreducible Cyclic Codes
As a generalization of cyclic codes, quasi-cyclic codes contain many good linear codes. Extensive search is made and lots of good quasi-cyclic codes are obtained from irreducible cyclic codes. A new binary [95, 13, 40] code which improves the lower bound on the minimum distance, is also constructed. Index Term — Codes and coding, linear codes, cyclic codes, idempotent, irreducible codes, quasi-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006